Plotkin construction: rank and kernel
نویسندگان
چکیده
Given two binary codes of length n, using Plotkin construction we obtain a code of length 2n. The construction works for linear and nonlinear codes. For the linear case, it is straightforward to see that the dimension of the final code is the sum of the dimensions of the starting codes. For nonlinear codes, the rank and the dimension of the kernel are standard measures of linearity. In this report, we prove that both parameters are also the sum of the corresponding ones of the starting codes.
منابع مشابه
Z2Z4linear codes: rank and kernel
A code C is Z2Z4-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y ) is a binary linear code (respectively, a quaternary linear code). In this paper, the rank and dimension of the kernel for Z2Z4-linear codes, which are the corresponding binary codes of Z2Z4-additive codes, are ...
متن کاملStructured Block Basis Factorization for Scalable Kernel Matrix Evaluation
Kernel matrices are popular in machine learning and scientific computing, but they are limited by their quadratic complexity in both construction and storage. It is well-known that as one varies the kernel parameter, e.g., the width parameter in radial basis function kernels, the kernel matrix changes from a smooth low-rank kernel to a diagonally-dominant and then fully-diagonal kernel. Low-ran...
متن کاملConstruction of Hadamard ℤ2 ℤ4 Q8-Codes for Each Allowable Value of the Rank and Dimension of the Kernel
This work deals with Hadamard Z2Z4Q8-codes, which are binary codes after a Gray map from a subgroup of a direct product of Z2, Z4 and Q8 groups, where Q8 is the quaternionic group. In a previous work, these kind of codes were classified in five shapes. In this paper we analyze the allowable range of values for the rank and dimension of the kernel, which depends on the particular shape of the co...
متن کاملConstruction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their generalization is the code for b-symbol read channels (b > 2). Many MDS codes for b-symbol read channels have been constructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11] for b > 2). In this paper we s...
متن کاملList Decoding of Reed-Muller Codes Based on a Generalized Plotkin Construction
Gopalan, Klivans, and Zuckerman proposed a listdecoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generaliza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0707.3878 شماره
صفحات -
تاریخ انتشار 2007